#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
vector<LL>g[maxn];
LL in[maxn],out[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,m;cin>>n>>m;
   for(LL i=1;i<=m;i++){
       LL u,v;cin>>u>>v;
       if(u>v){
          out[u]++;in[v]++;
          g[v].push_back(u);
       }
       else{
          in[u]++;out[v]++;
          g[u].push_back(v);
       }
   }
   LL ans=0;
   for(LL i=1;i<=n;i++) ans+=in[i]*out[i];
   cout<<ans<<"\n";
   LL q;cin>>q;
   while(q--){
       LL u;cin>>u;
       for(LL i=0;i<g[u].size();i++){
           LL v=g[u][i];
           ans-=out[u]+in[v];
           out[v]--;
           in[v]++;
           in[u]--;
           out[u]++;
           ans+=in[u]+out[v];

           g[v].push_back(u);
       }
       g[u].clear();

       cout<<ans<<"\n";
   }
   return 0;
}
